841. Korf R. E. (1993) Linear-space best-first search. Artificial Intelligence, 52(1), p. 41-78.

842. Korf R. E. (1995) Space-efficient search algorithms. ACM Computing Surveys, 27(3), p. 337-339.

843. Korf R. E. and Chickering D. M. (1996) Best-first minimax search. Artificial Intelligence, 84(1—2), p.

299-337.

844. Korf R. E. and Felner A. (2002) Disjoint pattern database heuristics. Artificial Intelligence, 134(1—2), p. 9-22.

845. Korf R. E. and Zhang W. (2000) Divide-and-conquer frontier search applied to optimal sequencealignment. In Proceedings of the 17th National Conference on Artificial Intelligence, p. 910-916, Cambridge, Massachusetts. MIT Press.

846. Kortenkamp D., Bonasso R. P., and Murphy R. (Eds.) (1998) Al-based Mobile Robots: Case studies ofsuccessful robot systems, Cambridge, MA. MIT Press.

847. Kotok A. (1962) A chess playing program for the IBM 7090. Ai project memo 41, MIT ComputationCenter, Cambridge, Massachusetts.

848. Koutsoupias E. and Papadimitriou С. Н. (1992) On the greedy algorithm for satisfiability. InformationProcessing Letters, 43(\), p. 53-55.

849. Kowalski R. (1974) Predicate logic as a programming language. In Proceedings of the IFIP-74 Congress,p. 569-574. Elsevier/North-Holland.

850. Kowalski R. (1979a) Algorithm = logic + control. Communications of the Association for ComputingMachinery, 22, p. 424-436.

851. Kowalski R. (1979b) Logic for Problem Solving. Elsevier/North-Holland, Amsterdam, London, New York.

852. Kowalski R. (1988) The early years of logic programming. Communications of the Association forComputing Machinery, 31, p. 38—43.

853. Kowalski R. and Kuehner D. (1971) Linear resolution with selection function. Artificial Intelligence,2(3-4), p. 227-260.

854. Kowalski R. and Sergot M. (1986) A logic-based calculus of events. New Generation Computing, 4(1),p. 67-95.

855. Koza J. R. (1992) Genetic Programming: On the Programming of Computers by Means of NaturalSelection. MIT Press, Cambridge, Massachusetts.

856. Koza J. R. (1994) Genetic Programming II: Automatic discovery of reusable programs. MIT Press,Cambridge, Massachusetts.

857. Koza J. R., Bennett F. H., Andre D., and Keane M. A. (1999) Genetic Programming III: Darwinianinvention and problem solving. Morgan Kaufmann, San Mateo, California.

858. Kraus S., Ephrati E., and Lehmann D. (1991) Negotiation in a non-cooperative environment. Journalof Experimental and Theoretical Artificial Intelligence, 3(A), 255—281.

859. Kripke S. A. (1963) Semantical considerations on modal logic. Acta Philosophica Fennica, 16, p. 83—94.

860. Krovetz R. (1993) Viewing morphology as an inference process. In Proceedings of the Sixteenth AnnualInternational ACM-SIGIR Conference on Research and Development in Information Retrieval, p. 191-202, New York. ACM Press.